Generalizing Truth-Functionality

نویسنده

  • João Marcos
چکیده

A common standard for the interpretation of classical propositional logic is set by the functionally complete collection of 2-valued truth-tables. The structure of the free algebra of formulas is faithfully mirrored in the semantics: In each admissible model, each sentential letter freely ranges over the set of truth-values, and to each n-ary logical constant there corresponds a convenient n-ary operator over those same truth-values. The whole approach is easily generalizable so as to define the class of truth-functional logics, i.e., many-valued logics whose operators can be characterized by truth-tables over some convenient set of truth-values. A further interesting generalization of the above idea is produced by the so-called nondeterministic truth-tabular semantics (N-truth-tables), where each n-ary operator is allowed to choose in between a number of possible outputs for each given n-uple of inputs. The set of admissible models may thus be enlarged, allowing for the natural adequate interpretation of more generous classes of non-classical logics. Yet another generalization of the same idea is given by the so-called possible-translations semantics with many-valued ingredients (Manyvalued PTS), where each model of a logic L is given by an admissible translation of L into an appropriate many-valued logic Lk coupled with a standard many-valued valuation from Lk. In the finite-valued case, logics with truth-tabular or N-truth-tabular semantics share interesting meta-properties such as compacity and decidability. Finite-valued PTS are also guaranteed to share those properties as soon as all the corresponding admissible translations are recursively defined. However, several logics known to be uncharacterizable by finite-valued truth-tables can be adequately characterized by finite-valued N-truth-tables, and several logics that have no finite-valued N-truth-tabular characterization can be characterized by finite-valued PTS. The present contribution will examine and illustrate the multiple relations between the three above mentioned alternative styles of semantics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consistent Judgement Aggregation: The Truth-Functional Case1

Generalizing the celebrated “discursive dilemma,” we analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions (the “conclusions”) and on a set of “premises” by which the conclusions are truth-functionally determined. We show that for conclusionand premise-based aggregation rules to be mutually consistent, the aggregation must always ...

متن کامل

Hyper-Contradictions, Generalized Truth Values and Logics of Truth and Falsehood

In Philosophical Logic, the Liar Paradox has been used to motivate the introduction of both truth value gaps and truth value gluts. Moreover, in the light of “revenge Liar” arguments, also higherorder combinations of generalized truth values have been suggested to account for so-called hypercontradictions. In the present paper, Graham Priest’s treatment of generalized truth values is scrutinize...

متن کامل

Truth functionality and measure-based logics

We present a truth-functional semantics for necessity-valued logics, based on the forcing technique. We interpret possibility distributions (which correspond to necessity measures) as informational states, and introduce a suitable language (basically, an extension of classical logic, similar to Pavelka’s language). Then we define the relation of “forcing” between an informational state and a fo...

متن کامل

Type-2 implications on non-interactive fuzzy truth values

In this paper we consider algebras of fuzzy truth values equipped with an implication operation. Generalizing the definition of type-1 fuzzy implications, we discuss extended fuzzy S-implications and coimplications and also extended residual implications and coimplications, in particular to the extended residual of minimum. We study the algebraic properties of these operations and their relatio...

متن کامل

Computing a Model of Set Theory

We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The generalized Turing machine is able to compute a recursive bounded truth predicate on the ordinals. The class of sets of ordinals which can be read off the truth predicate satisfies a natural theory SO. SO is the theory of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006